Application of mathematical optimization in elliptic curve arithmetic
نویسندگان
چکیده
منابع مشابه
New Formulae for Efficient Elliptic Curve Arithmetic
This paper is on efficient implementation techniques of Elliptic Curve Cryptography. In particular, we improve timings for Jacobiquartic (3M+4S) and Hessian (7M+1S or 3M+6S) doubling operations. We provide a faster mixed-addition (7M+3S+1d) on modified Jacobiquartic coordinates. We introduce tripling formulae for Jacobi-quartic (4M+11S+2d), Jacobi-intersection (4M+10S+5d or 7M+7S+3d), Edwards (...
متن کاملPerformance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem Zhi Li, John Higgins, Mark Clement 3361 TMCB Brigham Young University Provo, UT 84602 {zli,higgins,clement}@cs.byu.edu Abstract As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance bottleneck for ma...
متن کاملFast Implementation of Elliptic Curve Arithmetic in GF(pn)
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n)(p a prime), in particular , fast eld multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملStudy of Finite Field over Elliptic Curve: Arithmetic Means
Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bezopasnost informacionnyh tehnology
سال: 2017
ISSN: 2074-7136,2074-7128
DOI: 10.26583/bit.2017.3.08